Forestation in Hypergraphs: Linear k-Trees
نویسنده
چکیده
We present a new proof of a result of Lovász on the maximum number of edges in a k-forest. We also apply a construction used in our proof to generalize the notions of a k-hypertree and k-forest to a class which extends some properties of trees, to which both specialize when k=2.
منابع مشابه
Recognising k-Connected Hypergraphs in Cubic Time
Drewes, F., Recognising k-connected hypergraphs in cubic time, Theoretical Computer Science 109 (1993) 833122. Hypergraph languages generated by hyperedge-replacement grammars of order k are studied. It is shown that for k-connected hypergraphs having hyperedges of rank k only the membership problem with respect to such a language is decidable in cubic time. This extends the corresponding resul...
متن کاملOn decomposing a hypergraph into k connected sub-hypergraphs
By applying the matroid partition theorem of J. Edmonds [1] to a hypergraphic generalization of graphic matroids, due to M. Lorea [3], we obtain a generalization of Tutte’s disjoint trees theorem for hypergraphs. As a corollary, we prove for positive integers k and q that every (kq)-edge-connected hypergraph of rank q can be decomposed into k connected sub-hypergraphs, a well-known result for q...
متن کاملRisk Assessment for Contaminated Sites in Europe
This book is printed on acid-free paper responsibly manufactured from sustainable forestation, for which at least two trees are planted for each one used for paper production.
متن کاملOn the Size-Ramsey Number of Hypergraphs
The size-Ramsey number of a graph G is the minimum number of edges in a graph H such that every 2-edge-coloring of H yields a monochromatic copy of G. Size-Ramsey numbers of graphs have been studied for almost 40 years with particular focus on the case of trees and bounded degree graphs. We initiate the study of size-Ramsey numbers for k-uniform hypergraphs. Analogous to the graph case, we cons...
متن کاملWeak hypergraph regularity and linear hypergraphs
We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers ` ≥ k ≥ 2 and every d > 0 there exists % > 0 for which the following holds: if H is a sufficiently large kuniform hypergra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 10 شماره
صفحات -
تاریخ انتشار 2003